On Interior-point Methods and Simplex Method in Linear Programming
نویسندگان
چکیده
In this paper we treat numerical computation methods for linear programming. Started from the analysis of the efficiency and defficiency of the simplex procedure, we present new possibilities offered by the interior-point methods, which appears from practical necessity, from the need of efficient means of solving large-scale problems. We realise the implementation in Java of the Karmarkar’s method.
منابع مشابه
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, mainly due to inefficiencies of barrier methods. Interior point methods became quit popular again after 1984, when Karmarkar announced a fast polynomial-time interior method for nonlinear programming [Karmarkar, 1984]. In this section we present primal-dual in...
متن کاملABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملInterior Point Methods and Linear Programming
The linear programming problem is usually solved through the use of one of two algorithms: either simplex, or an algorithm in the family of interior point methods. In this article two representative members of the family of interior point methods are introduced and studied. We discuss the design of these interior point methods on a high level, and compare them to both the simplex algorithm and ...
متن کاملLinear Programming
This paper is a short didactical introduction to Linear Programming (LP). The main topics are: formulations, notes in convex analysis, geometry of LP, simplex method, duality, ellipsoid algorithm, interior point methods.
متن کاملOn the complexity of linear programming
This is a partial survey of results on the complexity of the linear programming problem since the ellipsoid method. The main topics are polynomial and strongly polynomial algorithms, probabilistic analysis of simplex algorithms, and recent interior point methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005